Circumscribing Inconsistency
نویسندگان
چکیده
We present a new logical approach to reasoning from inconsistent information. The idea is to restore modelhood of inconsistent formulas by providing a third truth-value tolerating inconsistency. The novelty of our approach stems first from the restriction of entailment to three-valued models as similar as possible to two-valued models and second from an implication connective providing a notion of restricted monotonicity. After developing the semantics, we present a corresponding proof system that relies on a circumscription schema furnishing the syntactic counterpart of model minimization.
منابع مشابه
Hamiltonian Triangulations and Circumscribing Polygons
Let Σ = { S1 , . . . , Sn } be a finite set of disjoint line segments in the plane. We conjecture that its visibility graph, Vis(Σ), is hamiltonian. In fact, we make the stronger conjecture that Vis(Σ) has a hamiltonian cycle whose embedded version is a simple polygon (i.e., its boundary edges are non-crossing visibility segments). We call such a simple polygon a spanning polygon of Σ. Existenc...
متن کاملGeneration of Fullerenes by Circumscribing
für Naturforschung in cooperation with the Max Planck Society for the Advancement of Science under a Creative Commons Attribution 4.0 International License. Dieses Werk wurde im Jahr 2013 vom Verlag Zeitschrift für Naturforschung in Zusammenarbeit mit der Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. digitalisiert und unter folgender Lizenz veröffentlicht: Creative Commons Namen...
متن کاملOn the time complexity for circumscribing a convex polygon
A recent article "Circumscribing a Convex Polygon by a Polygon of Fewer Sides with Minimal Area Addition" by Dori and Ben-Bassat, Comput. Vision Graph. Image Process. 24, 1983, 131-159, raised several interesting questions including the time complexity of their algorithm. In this paper, the time complexity on circumscribing an n-gon by an m-gon, where m < n, is analyzed to be O(n lg n). © 1985 ...
متن کاملCircumscribing Constant-Width Bodies with Polytopes
Makeev conjectured that every constant-width body is inscribed in the dual difference body of a regular simplex. We prove that homologically, there are an odd number of such circumscribing bodies in dimension 3, and therefore geometrically there is at least one. We show that the homological answer is zero in higher dimensions, a result which is inconclusive for the geometric question. We also g...
متن کاملOn the Smallest Enclosing Balls
In the paper a theoretical analysis is given for the smallest ball that covers a finite number of points p1, p2, · · · , pN ∈ R . Several fundamental properties of the smallest enclosing ball are described and proved. Particularly, it is proved that the k-circumscribing enclosing ball with smallest k is the smallest enclosing ball, which dramatically reduces a possible large number of computati...
متن کامل